#include<stdio.h>
#include<stdlib.h>
int a[] = {1,0,4,3,2};
int n = 5;
void selection_sort()
{
    int i = 0, j = 0, temp = 0;
    int min_index = 0;
    for( i = 0; i < n - 1; i++)
    {
        min_index = i;
        for( j = i+1; j < n; j++)
        {
            if(a[j] < a[min_index])
                min_index = j;
        }
        temp = a[min_index];
        a[min_index] = a[i];
        a[i] = temp;
    }
    for(i = 0; i < n; i++)
        printf("%d " , a[i]);
}
void insertion_sort()
{
    int i = 0, temp = 0, j = 0;
    for( i = 1; i < n; i++)
    {
        temp = a[i];
        j = i-1;
        while(j >= 0 && a[j] > temp)
        {
            a[j+1] = a[j];
            j--;
        }
        a[j+1] = temp;
    }
    for(i = 0; i < n; i++)
        printf("%d " , a[i]);
}
int main()
{
    insertion_sort();
    return 0;
}